A Primal-Dual Finite Element Approximation for a Nonlocal Model in Plasticity
نویسندگان
چکیده
منابع مشابه
A Primal-Dual Finite Element Approximation for a Nonlocal Model in Plasticity
We study the numerical approximation of a static in nitesimal plasticity model of kinematic hardening with a nonlocal extension involving the curl of the plastic variable. Here, the free energy to be minimized is a combination of the elastic energy and an additional term depending on the curl of the plastic variable. In a rst step, we introduce the stress as dual variable and provide an equival...
متن کاملConvergence Analysis of Primal-dual Based Methods for Total Variation Minimization with Finite Element Approximation
We consider the total variation minimization model with consistent finite element discretization. It has been shown in the literature that this model can be reformulated as a saddle-point problem and be efficiently solved by the primal-dual method. The convergence for this application of the primal-dual method has also been analyzed. In this paper, we focus on a more general primaldual scheme w...
متن کاملA primal - dual approximation algorithm forthe
Given an undirected graph with nonnegative edge-costs, a subset of nodes of size k called the terminals, and an integer q between 1 and k, the minimum q-Steiner forest problem is to nd a forest of minimum cost with at most q trees that spans all the terminals. When q = 1, we have the classical minimum-cost Steiner tree problem on networks. In this note, we adapt a primal-dual approximation algo...
متن کاملOptimal order finite element approximation for a hyperbolic integro-differential equation
Semidiscrete finite element approximation of a hyperbolic type integro-differential equation is studied. The model problem is treated as the wave equation which is perturbed with a memory term. Stability estimates are obtained for a slightly more general problem. These, based on energy method, are used to prove optimal order a priori error estimates.
متن کاملA Primal-Dual Approximation Algorithm for the Steiner Forest Problem
Given an undirected graph with nonnegative edge-costs, a subset of nodes of size k called the terminals, and an integer q between 1 and k, the minimum q-Steiner forest problem is to find a forest of minimum cost with at most q trees that spans all the terminals. When q = 1, we have the classical minimum-cost Steiner tree problem on networks. We adapt a primal-dual approximation algorithm for th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 2011
ISSN: 0036-1429,1095-7170
DOI: 10.1137/100789397